The More, The Merrier?

نویسنده

  • Haiqin Wang
چکیده

The common belief is that a Bayesian network may achieve better performance with a more complex structure than a simpler structure which usually sacrifice the power of knowledge representation. It is often thought that having some additional nodes than necessary for knowledge representation does not, at least, deteriorate the performance of a Bayesian network. In practice, people often add some unnecessary nodes in order to make the network structure clearer to understand, or to reduce the dimensions of conditional probability tables of network nodes for the convenience of knowledge engineering. However, based on my experience in building Bayesian networks for web service diagnosis, such practice for convenience may cause unexpected results. Adding unnecessary nodes and growing the complexity of a Bayesian network may sometimes result in a worse performance. Such kind of practice should be taken care of very cautiously.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The More the Merrier? The Effect of Family Size and Birth Order on Children’s Education

There is an extensive theoretical literature that postulates a trade off between child quantity and quality within a family. However, there is little causal evidence that speaks to this theory. Using a rich dataset on the entire population of Norway over an extended period of time, we examine the effects of family size and birth order on the educational attainment of children. While we find a n...

متن کامل

T-Cell Subsets: The More the Merrier

This year, IL-17-producing T cells were recognized as a distinct lineage and soon thereafter, the cytokines responsible for their induction were delineated. Now, a transcription factor driving their development has been identified.

متن کامل

The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning

We empirically examine several ways of exploiting the information of multiple heuristics in a satisficing best-first search algorithm, comparing their performance in terms of coverage, plan quality, speed, and search guidance. Our results indicate that using multiple heuristics for satisficing search is indeed useful. Among the combination methods we consider, the best results are obtained by t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005